Dynamic simulation of non-penetrating flexible bodies
نویسندگان
چکیده
منابع مشابه
Deformed Distance Fields for Simulation of Non-Penetrating Flexible Bodies
We present a novel penetration depth estimation algorithm based on the use of deformed distance fields for simulation of non-penetrating flexible bodies. We assume that the continuum of non-rigid models are discretized using standard techniques, such as finite element methods. As the objects deform, the distance fields are deformed accordingly to estimate penetration depth, allowing enforcement...
متن کاملSimulation of Non - penetrating Elastic Bodies Using Distance
We present an eecient algorithm for simulation of non-penetrating exible bodies with nonlinear elasticity. We use nite element methods to discretize the continuum model of non-rigid objects and the fast marching level set method to precompute a distance eld for each un-deformed body. As the objects deform, the distance elds are deformed accordingly to estimate penetration depth, allowing enforc...
متن کاملSimulation of Non-penetrating Elastic Bodies Using Distance Fields
We present an e cient algorithm for simulation of non-penetrating exible bodies with nonlinear elasticity. We use nite element methods to discretize the continuum model of non-rigid objects and the fast marching level set method to precompute a distance eld for each undeformed body. As the objects deform, the distance elds are deformed accordingly to estimate penetration depth, allowing enforce...
متن کاملCritique: Fast Contact Force Computation for Non-Penetrating Rigid Bodies
In this paper, Baraff presents an algorithm for computing the contact forces between objects with static and dynamic friction. Unlike previous methods used to solve the problem where the problem was transformed into an optimization problem, Baraff's algorithm can be implemented by programmers with little experience in numerical programming. Further, his approach is faster and more reliable than...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGGRAPH Computer Graphics
سال: 1992
ISSN: 0097-8930
DOI: 10.1145/142920.134084